Nonmalleable Cryptography
نویسندگان
چکیده
The notion of non-malleable cryptography, an extension of semantically secure cryptography , is deened. Informally, the additional requirement is that given the ciphertext it is impossible to generate a diierent ciphertext so that the respective plaintexts are related. The same concept makes sense in the contexts of string commitment and zero-knowledge proofs of possession of knowledge. Non-malleable schemes for each of these three problems are presented. The schemes do not assume a trusted center; a user need not know anything about the number or identity of other system users.
منابع مشابه
The Power of Choice in Scheduling Parallel Tasks
A malleable parallel task is one that can be executed on any number of processors, with its execution time being a function of the number of processors allotted to it. A nonmalleable parallel task is one that requires a speciic number of processors. Given n independent parallel tasks and m identical processors, we consider the problem of scheduling these tasks to minimize average completion tim...
متن کاملNonmalleable Information Flow: Technical Report
Noninterference is a popular semantic security condition because it offers strong end-to-end guarantees, it is inherently compositional, and it can be enforced using a simple security type system. Unfortunately, it is too restrictive for real systems. Mechanisms for downgrading information are needed to capture real-world security requirements, but downgrading eliminates the strong compositiona...
متن کامل4-Round Concurrent Non-Malleable Commitments from One-Way Functions
How many rounds and which computational assumptions are needed for concurrent nonmalleable commitments? The above question has puzzled researchers for several years. Recently, Pass in [TCC 2013] proved a lower bound of 3 rounds when security is proven through black-box reductions to falsifiable assumptions. On the other side, positive results of Goyal [STOC 2011], Lin and Pass [STOC 2011] and G...
متن کاملFour-Round Concurrent Non-Malleable Commitments from One-Way Functions
How many rounds and which computational assumptions are needed for concurrent nonmalleable commitments? The above question has puzzled researchers for several years. Recently, Pass in [TCC 2013] proved a lower bound of 3 rounds when security is proven through black-box reductions to falsifiable assumptions. On the other side, positive results of Goyal [STOC 2011], Lin and Pass [STOC 2011] and G...
متن کاملNon-Malleable Codes
In this report,based on the paper of Dziembowski et al.'s [DPW10], we explain how we can construct an e cient code that is nonmalleable with respect to modi cations that e ect each bit of the codeword arbitrarily. A variety of modi cations of codewords are considered such as ipping each bit of the codeword, leaving it untouched, or setting it to either 0 or 1 but independently of the value of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM Review
دوره 45 شماره
صفحات -
تاریخ انتشار 2000